Matching Convex Shapes with Respect to the Symmetric Difference

Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties

The symmetric difference is a robust operator for measuring the error of approximating one shape by another. Given two convex shapes P and C, we study the problem of minimizing the volume of their symmetric difference under all possible scalings and translations of C. We prove that the problem can be solved by convex programming. We also present a combinatorial algorithm for convex polygons in ...

Some Properties of Certain Subclasses of Close-to-Convex and Quasi-convex Functions with Respect to 2k-Symmetric Conjugate Points

Elasticity-based Matching by Minimizing the Symmetric Difference of Shapes

We consider the problem of matching two shapes assuming these shapes are related by an elastic deformation. Using linearized elasticity theory and the finite element method we seek an elastic deformation that is caused by simple external boundary forces and accounts for the difference between the two shapes. Our main contribution is in proposing a cost function and an optimization procedure to ...

some properties of certain subclasses of close-to-convex and quasi-convex functions with respect to 2k-symmetric conjugate points

0

some properties of certain subclasses of close-to-convex and quasi-convex functions with respect to 2k-symmetric conjugate points